Regular Expressions with Counting: Weak versus Strong Determinism
نویسندگان
چکیده
We study deterministic regular expressions extended with the counting operator. There exist two notions of determinism, strong and weak determinism, which almost coincide for standard regular expressions. This, however, changes dramatically in the presence of counting. In particular, we show that weakly deterministic expressions with counting are exponentially more succinct and strictly more expressive than strongly deterministic ones, even though they still do not capture all regular languages. In addition, we present a finite automaton model with counters, study its properties and investigate the natural extension of the Glushkov construction translating expressions with counting into such counting automata. This translation yields a deterministic automaton if and only if the expression is strongly deterministic. These results then also allow to derive upper bounds for decision problems for strongly deterministic expressions with counting.
منابع مشابه
Checking Determinism of Regular Expressions with Counting
We give characterizations of strong determinism for regular expressions with counting, based on which we present an O(|ΣE ||E|) time algorithm to check whether an expression E with counting is strongly deterministic where ΣE is the set of distinct symbols in E. It improves the previous upper bound of O(|E|) time on the same decision problems for both standard regular expressions and regular exp...
متن کاملDeterministic Regular Expressions with Interleaving
We study the determinism checking problem for regular expressions extended with interleaving. There are two notions of determinism, i.e., strong and weak determinism. Interleaving allows child elements intermix in any order. Although interleaving does not increase the expressive power of regular expressions, its use makes the sizes of regular expressions be exponentially more succinct. We first...
متن کاملDeciding determinism of unary languages
In this paper, we investigate the complexity of deciding determinism of unary languages. First, we give a method to derive a set of arithmetic progressions from a regular expression E over a unary alphabet, and establish relations between numbers represented by these arithmetic progressions and words in L(E). Next, we define a problem relating to arithmetic progressions and investigate the comp...
متن کاملOn the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages. The complexity of their membership problem is equivalent to that of regular languages. However, the corresponding counting problem – computing the number of accepting paths in a visibly pushdown automaton – could be harder than counting paths in a non-deterministi...
متن کاملDeterministic Regular Expressions With Back-References
Most modern libraries for regular expression matching allow back-references (i. e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness and tractability, we combine these with the notion of determinism for regular expressions used in XML DTDs and XML Schema. This includes the definition of ...
متن کامل